Benchmarking DHTs with Queries
نویسندگان
چکیده
The recent proliferation of decentralized distributed hash table (DHT) proposals suggests a need for DHT benchmarks, both to compare existing implementations and to guide future innovation. We argue that a DHT-based query engine provides a unified framework for describing workloads and faultloads, injecting them into a DHT, and recording and analyzing the observed system behavior. To illustrate this argument, we describe the possibilities and challenges of using one such DHT database engine, PIER, to describe and instantiate network dataflow patterns, and to measure and report the resulting system performance. Together, these capabilities form the foundation of a benchmarking tool, while the distributed tracing and analysis facilities alone support debugging.
منابع مشابه
Range Queries over DHTs
Distributed Hash Tables (DHTs) are scalable peer-to-peer systems that support exact match lookups. This paper describes the construction and use of a Prefix Hash Tree (PHT) – a distributed data structure that supports range queries over DHTs. PHTs use the hash-table interface of DHTs to construct a search tree that is efficient (insertions/lookups take DHT lookups, where D is the data domain be...
متن کاملImplementing Range Queries with a Decentralized Balanced Tree Over DHTs
Range queries, retrieving all keys within a given range, is an important add-on for DHTs, as they rely only on exact key matching lookup. In this paper we support range queries by way of a tree algorithm, Decentralized Balanced Tree, that runs over any DHT system. Our algorithm is based on the B+ tree design that efficiently stores clustered data while maintaining a balanced load on hosts. The ...
متن کاملProcessing Top-k Queries in Distributed Hash Tables
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in large scale distributed systems, e.g. P2P systems. However, they only provide good support for exact-match queries, and it is hard to support complex queries such as top-k queries. In this paper, we propose a family of algorithms which deal with efficient processing of top-k queries in DHTs. We evaluated the performa...
متن کاملA Tabu-Based Cache to Improve Range Queries on Prefix Trees
Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications over Peerto-Peer networks. A major limitation of DHTs is that they only support exact-match queries. In order to offer range queries over a DHT it is necessary to build additional indexing structures. Prefix-based indexes, such as Prefix Hash Tree (PHT), are interesting approaches for building dis...
متن کاملCone: Augmenting DHTs to Support Distributed Resource Discovery
Together with the revolution in peer-to-peer content sharing, as exemplified by Napster and Gnutella, there has been a parallel revolution in peer-to-peer distributed computing as exemplified by SETI@home and Javelin. As with content sharing, P2P computing networks have evolved from centralized to distributed resource discovery. Thus a fundamental problem in P2P computing is to scalably answer ...
متن کامل